Technical Note—The Waiting Time in theEk/M/1 Queuing System

Note - Computing Time-Dependent Waiting Time Probabilities in M(t)/M/s(t) Queuing Systems

I n this note we present algorithms that compute, exactly or approximately, time-dependent waiting time tail probabilities and the time-dependent expected waiting time in Mt/M/st queuing systems.

Minimize the waiting time of Costumer and Gain more Profit in Restaurant Using Queuing Model

Today no body interested to wait for food in restaurant. Some restaurants initially provide more waiting chairs for customers However, waiting chairs alone would not solve a problem, and the service time may need to be improved. This shows a need of a numerical model for the restaurant management to understand the situation better. This paper aims that, using queuing theory satisfies the model ...

Maximum Entropy Analysis for G/G/1 Queuing System (TECHNICAL NOTE)

This paper provides steady state queue-size distribution for a G/G/1 queue by using principle of maximum entropy. For this purpose we have used average queue length and normalizing condition as constraints to derive queue-size distribution. Our results give good approximation as demonstrated by taking a numerical illustration. In particular case when square coefficient of variation of inter-arr...

Queuing Theory to Decrease Waiting Times in Emergency Department

Regarding the article: Application of queuing theory to decrease waiting times in emergency department: Does it make sense? published in Archives of Trauma Research (1), I would like to make some comments. Although results of the study by Alavi-Moghaddam et al. using queuing theory are particularly interesting to analyze the impact of a new strategy to reduce waiting times before implementing i...

queuing theory to decrease waiting times in emergency department